On the definable ideal generated by nonbounding c.e. degrees
نویسندگان
چکیده
Let [NB]1 denote the ideal generated by nonbounding c.e. degrees and NCup the ideal of noncuppable c.e. degrees. We show that both [NB]1 ∩ NCup and the ideal generated by nonbounding and noncuppable degrees are new, in the sense that they are different from M, [NB]1 and NCup — the only three known definable ideals so far.
منابع مشابه
On the definable ideal generated by the plus cupping c.e. degrees
In this paper we will prove that the plus cupping degrees generate a definable ideal on c.e. degrees different from other ones known so far, thus answer a question asked by A. Li and Yang.
متن کاملOn the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal
We show that minimal pairs exist in the quotient structure of R modulo the ideal of noncuppable degrees. In the study of mathematical structures it is very common to form quotient structures by identifying elements in some equivalence classes. By varying the equivalence relations, the corresponding quotient structures often reveal certain hidden features of the original structure. In this paper...
متن کاملMaximal Contiguous Degrees
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many maximal contiguous degrees. Since the contiguous degrees are definable, the class of maximal contiguous degrees provides the first example of a definable infinite anti-chain in the c.e. degrees. In addition, we show t...
متن کاملOn the distribution of Lachlan nonsplitting bases
We say that a computably enumerable (c.e.) degree b is a Lachlan nonsplitting base (LNB), if there is a computably enumerable degree a such that a > b, and for any c.e. degrees w,v ≤ a, if a ≤ w ∨ v ∨ b then either a ≤ w ∨ b or a ≤ v ∨ b. In this paper we investigate the relationship between bounding and nonbounding of Lachlan nonsplitting bases and the high /low hierarchy. We prove that there ...
متن کاملToward the Definability of the Array Noncomputable Degrees
by Stephen M. Walk We focus on a particular class of computably enumerable (c.e.) degrees, the array noncomputable degrees defined by Downey, Jockusch, and Stob, to answer questions related to array noncomputable degrees and definability in the partial ordering (R,≤) of c.e. degrees. First we demonstrate that the lattice M5 cannot be embedded into the c.e. degrees below every array noncomputabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 70 شماره
صفحات -
تاریخ انتشار 2005